Closed Subgroups in Pro-V Topologies and the Extension Problem for Inverse Automata
نویسندگان
چکیده
We relate the problem of computing the closure of a finitely generated subgroup of the free group in the pro-V topology, where V is a pseudovariety of finite groups, with an extension problem for inverse automata which can be stated as follows: given partial one-to-one maps on a finite set, can they be extended into permutations generating a group in V? The two problems are equivalent when V is extension-closed. Turning to practical computations, we modify Ribes and Zalesskĭı’s algorithm to compute the pro-p closure of a finitely generated subgroup of the free group in polynomial time, and to effectively compute its pro-nilpotent closure. Finally, we apply our results to a problem in finite monoid theory, the membership problem in pseudovarieties of inverse monoids which are Mal’cev products of semilattices and a pseudovariety of groups.
منابع مشابه
Closed Subgroups in Pro-v Topologies and the Extension Problem for Inverse Automata 1
We relate the problem of computing the closure of a nitely generated subgroup of the free group in the pro-V topology, where V is a pseudovariety of nite groups, with an extension problem for inverse automata which can be stated as follows: given partial one-to-one maps on a nite set, can they be extended into permutations generating a group in V? The two problems are equivalent when V is exten...
متن کاملSome (Fuzzy) Topologies on General\ Fuzzy Automata
In this paper, by presenting some notions and theorems, we obtaindifferent types of fuzzy topologies. In fact, we obtain someLowen-type and Chang-type fuzzy topologies on general fuzzyautomata. To this end, first we define a Kuratowski fuzzy interioroperator which induces a Lowen-type fuzzy topology on the set ofstates of a max- min general fuzzy automaton. Also by provingsome theorems, ...
متن کاملJ an 2 00 7 Two - letter group codes that preserve aperiodicity of inverse finite automata
We construct group codes over two letters (i.e., bases of subgroups of a two-generated free group) with special properties. Such group codes can be used for reducing algorithmic problems over large alphabets to algorithmic problems over a two-letter alphabet. Our group codes preserve aperiodicity of inverse finite automata. As an application we show that the following problems are PSpace-comple...
متن کاملTwo-letter group codes that preserve aperiodicity of inverse finite automata
We construct group codes over two letters (i.e., bases of subgroups of a two-generated free group) with special properties. Such group codes can be used for reducing algorithmic problems over large alphabets to algorithmic problems over a two-letter alphabet. Our group codes preserve aperiodicity of inverse finite automata. As an application we show that the following problems are PSPACE-comple...
متن کاملComputing Closures of Nitely Generated Subgroups of the Free Group
RR esum e The aim of this paper is to present computing techniques for the nitely generated subgroups of the free group. The focus is the computation of the closures of a nitely generated subgroup for certain proonite topologies, namely the prop and the pro-nilpotent topology. However the rst section concentrates on the eeective manipulation of nitely generated subgroups when more elementary op...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJAC
دوره 11 شماره
صفحات -
تاریخ انتشار 2001